Improvements on the Cantor-Zassenhaus Factorization Algorithm
نویسندگان
چکیده
We describe a new simplified version of the Cantor-Zassenhaus polynomial factorization algorithm, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but also enable us to derive good estimates and deterministic bounds on the number of attempts needed to factor a given polynomial. Mathematics Subject Classification (2010): 12Y05, 12E30
منابع مشابه
A New Algorithm for Factoring Polynomials Over Finite Fields
We present a new probabilistic algorithm for factoring polynomials over finite fields.
متن کاملAddendum to "Factoring polynomials over finite fields with Drinfeld modules"
After my paper [2] was electronically published by Mathematics of Computation, I came across the PhD thesis of professor I. Y. Potemine [6]. In Section 4.3 of his thesis, an algorithm for factoring polynomials is proposed which is equivalent to the algorithm discussed in my paper. Potemine’s algorithm is acknowledged in my PhD thesis [1]. Our algorithms were found independently, both as analogu...
متن کاملFactoring polynomials over finite fields with Drinfeld modules
In the following, we describe a way of factoring polynomials in Fq[X] with Drinfeld modules. We furthermore analyse the complexity of the algorithm and compare it to the well-known Cantor-Zassenhaus algorithm. 1. Defining Fq[X ]-module structures with Drinfeld modules Throughout this paper we will denote A = Fq[X ], where q is a power of some prime p, and N ∈ A for the polynomial which is to be...
متن کاملTeaching Computational Abstract Algebra
In the Spring semester of 1990 we undertook the educational experiment of teaching undergraduate mathematics and computer science students some fundamental notions of algebra by using computers. The course was entitled Computational Abstract Algebra and offered at Rensselaer Polytechnic Institute as a cross-listed mathematics and computer science course. Twelve students enrolled in it, five of ...
متن کاملPolynomial Factorization Challenges
Joachim von zur Gathen has proposed a challenge for factoring univariate poly-nomials over nite elds to evaluate the practicability of current factorization algorithms (\A Factorization Challenge", SIGSAM Bulletin 26(2):22-24, 1992). More recently, Victor Shoup has proposed an alternate family of polynomials with a similar goal in mind. Our eeort is to take these challenges on using the general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011